Polyhedral Geometry and the Two-Plane Parameterization
نویسندگان
چکیده
Recently the light-field and lumigraph systems have been proposed as general methods of representing the visual information present in a scene. These methods represent this information as a 4D function of light over the domain of directed lines. These systems use the intersection points of the lines on two planes to parameterize the lines in space. This paper explores the structure of the two-plane parameterization in detail. In particular we analyze the association between the geometry of the scene and subsets of the 4D data. The answers to these questions are essential to understanding the relationship between a lumigraph, and the geometry that it attempts to represent. This knowledge is potentially important for a variety of applications such as extracting shape from lumigraph data, and lumigraph compression.
منابع مشابه
On the Complexity of Polyhedral Separability
It is NP complete to recognize whether two sets of points in general space can be separated by two hyperplanes It is NP complete to recognize whether two sets of points in the plane can be separated with k lines For every xed k in any xed dimension it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes
متن کاملComposition of Local Normal Coordinates and Polyhedral Geometry in Riemannian Manifold Learning
The Local Riemannian Manifold Learning (LRML) recovers the manifold topology and geometry behind database samples through normal coordinate neighborhoods computed by the exponential map. Besides, LRML uses barycentric coordinates to go from the parameter space to the Riemannian manifold in order to perform the manifold synthesis. Despite of the advantages of LRML, the obtained parameterization ...
متن کاملDeformations of Period Lattices of Flexible Polyhedral Surfaces
In the end of the 19th century Bricard discovered a phenomenon of flexible polyhedra, that is, polyhedra with rigid faces and hinges at edges that admit non-trivial flexes. One of the most important results in this field is a theorem of Sabitov asserting that the volume of a flexible polyhedron is constant during the flexion. In this paper we study flexible polyhedral surfaces in R two-periodic...
متن کاملOn short cycles through prescribed vertices of a polyhedral graph
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved.
متن کاملStraightest Paths on Meshes by Cutting Planes
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightest path from a source to one or more vertices on a manifold mesh with a boundary. A cutting plane wi...
متن کامل